Optimized Branch and Bound for Path-wise Test Data Generation
نویسندگان
چکیده
منابع مشابه
A Branch and Bound Method for Finding Flow Path Designing of Agv Systems (RESEARCH NOTE)
One of the important factor in the design of automated guided vehicle systems (AGVS) is the flow path design. This paper presents a branch-and-bound algorithm to determining the flow path by considering not only loaded-vehicles, but also empty-vehicles. The objective is to find the flow path, which will minimize total travel of loaded vehicles. We know that in branch-and-bound method a branch c...
متن کاملA branch and bound algorithm for the robust shortest path problem with interval data
Many real problems in transportation and telecommunications can be modelled in mathematical terms as shortest path problems on interval digraphs, where an interval of costs is associated with each arc. Intervals represent uncertainty, typical of real situations, about the exact values of costs. In this context, a robust shortest path is a path which is ideally not too far from the best one, wha...
متن کاملBranch-and-Bound Algorithms for the Test Cover Problem
In the test cover problem a set of items is given together with a collection of subsets of the items, called tests. A smallest subcollection of tests is to be selected such that for every pair of items there is a test in the selection that contains exactly one of the two items. This problem is NP-hard in general. It has important applications in biology, pharmacy, and the medical sciences, as w...
متن کاملEBBA: Efficient Branch and Bound Algorithm for Protein Decoy Generation
We are faced with three major challenges when dealing with the problem of de novo protein structure prediction. One is to determine a suitable energy function having a global minimum near the native structure of the protein. The second challenge is to sample the conformational space such that some of the sampled decoys are near the native structure. The third challenge is to identify the native...
متن کاملA Prioritized Test Generation Method for Pair-wise Testing
The most sufficient test methods are based on a test case set which covers all combinations of parameters. However, the scale of test cases is always too large and their cost cannot be accepted. People will first consider the implementation of critical test cases. Even if the test is terminated suddenly, the test cases of high importance will have been executed. It improves the testing efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computers Communications & Control
سال: 2014
ISSN: 1841-9844,1841-9836
DOI: 10.15837/ijccc.2014.4.1169